Tabu search-based fleet scheduling of air ambulances for disaster response
نویسندگان
چکیده
منابع مشابه
A Hybrid Reactive Tabu Search for Liner Shipping Fleet Repositioning
We solve the liner shipping fleet repositioning problem (LSFRP), a key problem in the liner shipping industry, using a hybrid reactive tabu search and simulated annealing algorithm in combination with novel local search neighborhoods. Liner carriers reposition vessels between services in order to add, remove or modify services in their network. Repositioning vessels costs between hundreds of th...
متن کاملTabu Search based solution methods for scheduling log-trucks
We present Tabu Search based solution heuristics for the Timber Transport Vehicle Routing Problem (TTVRP) that differ with respect to solution space. The TTVRP is characterized as follows: a fleet of m log-trucks which are situated at the respective homes of the truck drivers has to fulfil n transports of round timber between different wood storage locations and industrial sites. All transports...
متن کاملA Tabu Search Based Approach for Work Zone Scheduling
This paper introduces a work zone scheduling methodology, which is intended to be used as a decision – aid tool for transportation planners that have to undertake a number of work zones larger than the available number of construction crews during a given time period. Two traffic assignment approaches are used to evaluate the traffic delay caused by work zone combinations and a Tabu Search meth...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملFlexible Assembly Job Shop Scheduling Based on Tabu Search
Flexible assembly job shop scheduling has been proved to be an NP-hard problem. To reduce the complexity, it is always divided into 2 sub-problems: routing sub-problem and sequencing sub-problem. In this paper, in order to develop a solution with high accuracy, we propose a method that can deal with these two sub-problems concurrently. Tabu search, one of the meta-heuristics, is adopted. Some e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Array
سال: 2020
ISSN: 2590-0056
DOI: 10.1016/j.array.2020.100047